Greedy decomposition integrals
نویسنده
چکیده مقاله:
In this contribution we define a new class of non-linear integrals based on decomposition integrals. These integrals are motivated by greediness of many real-life situations. Another view on this new class of integrals is that it is a generalization of both the Shilkret and PAN integrals. Moreover, it can be seen as an iterated Shilkret integral. Also, an example in time-series analysis is provided.
منابع مشابه
Greedy Clique Decomposition for Symbolic Satisfiability Solving
Motivated by the recent theoretical results regarding OBDD proof system, this paper applies a new variable grouping heuristic called greedy clique decomposition to symbolic satisfiability solving. Experimental results are compared against other state-of-the-art satisfiability solving tools, including Ebddres, Minisat, TTS and SSAT. We are able to show that with this new heuristic method, our im...
متن کاملGreedy Approaches to Symmetric Orthogonal Tensor Decomposition
Finding the symmetric and orthogonal decomposition (SOD) of a tensor is a recurring problem in signal processing, machine learning and statistics. In this paper, we review, establish and compare the perturbation bounds for two natural types of incremental rank-one approximation approaches. Numerical experiments and open questions are also presented and discussed.
متن کاملQuantum Stochastic Integrals and Doob-meyer Decomposition
Abstract. We show that for a quantum L-martingale (X(t)), p > 2, there exists a Doob-Meyer decomposition of the submartingale (|X(t)|). A noncommutative counterpart of a classical process continuous with probability one is introduced, and a quantum stochastic integral of such a process with respect to an L-martingale, p > 2, is constructed. Using this construction, the uniqueness of the Doob-Me...
متن کاملANALYTIC p-ADIC CELL DECOMPOSITION AND INTEGRALS
We prove a conjecture of Denef on parameterized p-adic analytic integrals using an analytic cell decomposition theorem, which we also prove in this paper. This cell decomposition theorem describes piecewise the valuation of analytic functions (and more generally of subanalytic functions), the pieces being geometrically simple sets, called cells. We also classify subanalytic sets up to subanalyt...
متن کاملSolving Difficult SAT Instances Using Greedy Clique Decomposition
We are dealing with solving difficult SAT instances in this paper. We propose a method for preprocessing SAT instances (CNF formulas) by using consistency techniques known from constraint programming methodology and by using our own consistency technique based on clique decomposition of a graph representing conflicts in the input formula. The clique decomposition allows us to make a strong reas...
متن کاملA Greedy Algorithm for a Sparse Scalet Decomposition
Sparse decompositions were mainly developed to optimize the signal or the image compression. The sparsity was first obtained by a coefficient thresholding. The matching pursuit (MP) algorithms were implemented to extract the optimal patterns from a given dictionary. They carried out a new insight on the sparse representations. In this communication, this way is followed. It takes into account t...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 17 شماره 5
صفحات 23- 28
تاریخ انتشار 2020-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023